Allen–Cahn min-max on surfaces

نویسندگان

چکیده

We use a min-max procedure on the Allen–Cahn energy functional to construct geodesics closed, $2$‑dimensional Riemannian manifolds, as motivated by work of Guaraco [Gua18]. Borrowing classical blowup and curvature estimates from geometric analysis, well novel due Wang–Wei [WW19], we manage study fine structure potential singular points at diffuse level, show that problem reduces understanding “entire” singularity models constructed del Pino–Kowalczyk–Pacard [dPKP13] with Morse index $1$. The argument is completed estimate these models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The min–max construction of minimal surfaces

In this paper we survey with complete proofs some well–known, but hard to find, results about constructing closed embedded minimal surfaces in a closed 3-dimensional manifold via min–max arguments. This includes results of J. Pitts, F. Smith, and L. Simon and F. Smith. The basic idea of constructing minimal surfaces via min–max arguments and sweep-outs goes back to Birkhoff, who used such a met...

متن کامل

Genus Bounds for Minimal Surfaces Arising from Min-max Constructions

In this paper we prove genus bounds for closed embedded minimal surfaces in a closed 3-dimensional manifold constructed via min-max arguments. A stronger estimate was announced by Pitts and Rubistein but to our knowledge its proof has never been published. Our proof follows ideas of Simon and uses an extension of a famous result of Meeks, Simon and Yau on the convergence of minimizing sequences...

متن کامل

Unifying View on Min-Max Fairness, Max-Min Fairness, and Utility Optimization in Cellular Networks

We are concerned with the control of quality of service (QoS) in wireless cellular networks utilizing linear receivers. We investigate the issues of fairness and total performance, which are measured by a utility function in the form of a weighted sum of link QoS. We disprove the common conjecture on incompatibility of min-max fairness and utility optimality by characterizing network classes in...

متن کامل

Dynamic Min-Max Problems

A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. 20 2. G t is a dominating subgraph of G c as there are no edges between nodes v i 2 V ? t and v j 2 (V + nV + t), G t has a min-max potential and G c has a min potential. G t is a maximal dominating subgraph of G c. To proof this, let us suppose that a subgraph G q of G c nG t cou...

متن کامل

Min - Max Heaps

,4 simple implementation of doubleended priority queues is presented. The proposed structure, called a min-max heap, can be built in linear time; in contrast to conventional heaps, it allows both FindMin and FindMax to be performed in constant time; Insert, DeleteMin, and DeleteMax operations can be performed in logarithmic time. Min-max heaps can be generalized to support other similar order-s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Differential Geometry

سال: 2021

ISSN: ['1945-743X', '0022-040X']

DOI: https://doi.org/10.4310/jdg/1609902018